Lexicographic Gröbner bases for transportation problems of format r×3×3
نویسندگان
چکیده
By means of suitable sequences of graphs, we describe the reduced lexicographic Gröbner basis of the toric ideal associated with the 3−dimensional transportation problem of format r× 3× 3 (r any integer > 1). In particular, we prove that the bases for r = 2, 3, 4, 5 determine all others.
منابع مشابه
Gröbner bases related to 3-dimensional transportation problems
This paper illustrates some work in progress on 3-dimensional transportation problems,of format r×s×t say. Following Conti and Traverso, a suitable Gröbner basis is sought for, which is hard to be calculated by means of Buchberger algorithm. A different approach involving graph theory makes the calculation tractable when r = s = t = 3 (and in fact whenever 3 ∈ {r, s, t}). Introduction The aim o...
متن کاملCounting and Gröbner Bases
Gröbner bases were introduced by Buchberger (1965) and are now firmly established as a tool in Commutative Algebra and other areas. The reader is referred to Buchberger (1985), Cox, Little and O’Shea (1992) or Becker and Weispfenning (1993) for more information. Eisenbud (1995) places Gröbner bases within the context of more advanced Commutative Algebra. The ingredients for a Gröbner basis are ...
متن کاملOn lexicographic Groebner bases of radical ideals in dimension zero: interpolation and structure
Due to the elimination property held by the lexicographic monomial order, the corresponding Gröbner bases display strong structural properties from which meaningful informations can easily be extracted. We study these properties for radical ideals of (co)dimension zero. The proof presented relies on a combinatorial decomposition of the finite set of points whereby iterated Lagrange interpolatio...
متن کاملSubtotal ordering -- a pedagogically advantageous algorithm for computing total degree reverse lexicographic order
Total degree reverse lexicographic order is currently generally regarded as most often fastest for computing Gröbner bases. This article describes an alternate less mysterious algorithm for computing this order using exponent subtotals and describes why it should be very nearly the same speed the traditional algorithm, all other things being equal. However, experimental evidence suggests that s...
متن کاملGröbner Bases: A Short Introduction for Systems Theorists
In this paper, we give a brief overview on Gröbner bases theory, addressed to novices without prior knowledge in the field. After explaining the general strategy for solving problems via the Gröbner approach, we develop the concept of Gröbner bases by studying uniquenss of polynomial division ("reduction"). For explicitly constructing Gröbner bases, the crucial notion of S polynomials is introd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 41 شماره
صفحات -
تاریخ انتشار 2006